Super-Shuffle Product and Cut-Box Coproduct on (0,1)-Matrices

On the Partially Commutative Shuffle Product

Duchamp, G. and D. Krob, On the partially commutative shuffle product, Theoretical Computer Science 96 (1992) 405410. We give recursive formulas that allow us to compute the partially commutative shuffle product of two partially commutative words.

Shuffle Product of Generating Series

Rotella, F., Shuffle product of generating series, Theoretical Computer Science 79 ( 1991) 257-261. In this note, we give a short proof of the explicit and recurrent construction of the shuffle product of two noncommutative formal power serIfis This construction is simply expressed in terms of linear matrix algebra.

The super connectivity of shuffle-cubes

The shuffle-cube SQn, where n ≡ 2 (mod 4), a new variation of hypercubes proposed by Li et al. [T.-K. Li, J.J.M. Tan, L.-H. Hsu, T.-Y. Sung, The shuffle-cubes and their generalization, Inform. Process. Lett. 77 (2001) 35–41], is an n-regular n-connected graph. This paper determines that the super connectivity of SQn is 2n − 4 and the super edge-connectivity is 2n− 2 for n 6.  2005 Elsevier B.V...

On Recognizing Words That Are Squares for the Shuffle Product

Shuffle Product Formulas of Multiple Zeta Values

Using the combinatorial description of shuffle product, we prove or reformulate several shuffle product formulas of multiple zeta values, including a general formula of the shuffle product of two multiple zeta values, some restricted shuffle product formulas of the product of two multiple zeta values, and a restricted shuffle product formula of the product of n multiple zeta values.